Preference-Based Planning via MaxSAT
نویسندگان
چکیده
In this paper, we explore the application of partial weighted MaxSAT techniques for preference-based planning (PBP). To this end, we develop a compact partial weighted MaxSAT encoding for PBP based on the popular SAS planning formalism. Our encoding extends a SAS based encoding for SAT-based planning, SASE, to allow for the specification of simple preferences. To the best of our knowledge, the SAS formalism has never been exploited in the context of PBP. Our MaxSATbased PBP planner, MSPlan, significantly outperformed the state-ofthe-art STRIPS-based MaxSAT approach for PBP with respect to running time, solving more problems in a few cases. Interestingly, when compared to three state-of-the-art heuristic search planners for PBP, MSPlan consistently generated plans with comparable quality, slightly outperforming at least one of these three planners in almost every case. Our results illustrate the effectiveness of our SASE based encoding and suggests that MaxSAT-based PBP is a promising area of research.
منابع مشابه
Exploiting MaxSAT for Preference-Based Planning
In this paper, we explore the application of partial weighted MaxSAT techniques for preference-based planning (PBP). To this end, we develop a compact partial weighted MaxSAT encoding for PBP based on the SAS formalism. Our encoding extends a SAS based encoding for SAT-based planning, SASE, to allow for the specification of simple preferences. To the best of our knowledge, the SAS formalism has...
متن کاملPartial Weighted MaxSAT for Optimal Planning
We consider the problem of computing optimal plans for propositional planning problems with action costs. In the spirit of leveraging advances in general-purpose automated reasoning for that setting, we develop an approach that operates by solving a sequence of partial weighted MaxSAT problems, each of which corresponds to a step-bounded variant of the problem at hand. Our approach is the first...
متن کاملCost-Optimal Planning using Weighted MaxSAT
We consider the problem of computing optimal plans for propositional planning problems with action costs. In the spirit of leveraging advances in general-purpose automated reasoning for that setting, we develop an approach that operates by solving a sequence of partial weighted MaxSAT problems, each of which corresponds to a step-bounded variant of the problem at hand. Our approach is the first...
متن کاملImproving the Effectiveness of SAT-Based Preprocessing for MaxSAT
Solvers for the Maximum satisfiability (MaxSAT) problem find an increasing number of applications today. We focus on improving MaxHS—one of the most successful recent MaxSAT algorithms— via SAT-based preprocessing. We show that employing SAT-based preprocessing via the so-called labelled CNF (LCNF) framework before calling MaxHS can in some cases greatly degrade the performance of the solver. A...
متن کاملMAXSAT Heuristics for Cost Optimal Planning
The cost of an optimal delete relaxed plan, known as h, is a powerful admissible heuristic but is in general intractable to compute. In this paper we examine the problem of computing h by encoding it as a MAXSAT problem. We develop a new encoding that utilizes constraint generation to supports the computation of a sequence of increasing lower bounds on h. We show a close connection between the ...
متن کامل